منابع مشابه
On Relations of Constituency and Dependency Grammars
This paper looks at integrating dependency and constituency into a common framework, using the TAG formalism and a di erent perspective on the meta-level grammar of Dras (1999a) in which the meta level models dependencies and the object level models constituency. This framework gives consistent dependency analyses of raising verbs interacting with bridge verbs, additionally giving a solution to...
متن کاملA Model Based on Dependency Relations
E-transactions via shopping agents constitute a promising opportunity in the e-markets. In this article we will discuss the problem of contract negotiation in e-marketplaces. We succinctly present an overview of protocols commonly used to implement negotiation in e-markets. An analysis of the interaction process within e-markets according to different situation of individual and joint profit/co...
متن کاملDependency Parsing with Short Dependency Relations in Unlabeled Data
This paper presents an effective dependency parsing approach of incorporating short dependency information from unlabeled data. The unlabeled data is automatically parsed by a deterministic dependency parser, which can provide relatively high performance for short dependencies between words. We then train another parser which uses the information on short dependency relations extracted from the...
متن کاملAnnotation of Selected Non-dependency Relations in a Dependency Treebank
The following paper has two aims. First, it introduces a procedure of a manual annotation of selected linguistic phenomena across a large-scale dependency treebank of English. The method was designed to provide higher consistency of annotated data, and so higher credibility of the treebank. Second, the first expert task completed by means of this method is being described – the annotation of rh...
متن کاملInvestigations on Armstrong Relations , Dependency Inference , andExcluded Functional
This paper rst presents some new results on excluded functional dependencies, i.e., FDs which do not hold on a given relation schema. In particular, we show how excluded dependencies relate to Armstrong relations, and we state criteria for deciding whether a set of excluded dependencies characterizes a set of FDs. In the rest of the paper, complexity issues related to the following three proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1994
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(05)80045-5